A Domain Decomposition Method for Frictional Contact Problem
نویسندگان
چکیده
منابع مشابه
Domain decomposition method for contact problems with small range contact
A non-overlapping domain decomposition algorithm of Neumann–Neumann type for solving variational inequalities arising from the elliptic boundary value problems in two dimensions with unilateral boundary condition is presented. We suppose that boundary with inequality condition is ‘relatively’ small. First, the linear auxiliary problem, where the inequality condition is replaced by the equality ...
متن کاملUse of Matlab for Domain Decomposition Method for Contact Problem in Elasticity
In the present paper we will deal with numerical solution of a generalized semicoercive contact problem in linear elasticity, for the case that several bodies of arbitrary shapes are in mutual contacts and are loaded by external forces, by using the non-overlapping domain decomposition and finite elements method. The numerical example will be presented.
متن کاملUzawa Block Relaxation Domain Decomposition Method for the Two-Body Contact Problem With Tresca Friction
We propose a Uzawa block relaxation domain decomposition method for a two-body contact problem with Tresca friction. We introduce auxiliary interface unknowns to transform the variational problem into a saddle-point problem. Applying a Uzawa block relaxation algorithm to the corresponding augmented Lagrangian functional we obtain a domain decomposition algorithm in which we have to solve two un...
متن کاملAn Uzawa Domain Decomposition Method for Stokes Problem
The Stokes problem plays an important role in computational fluid dynamics since it is encountered in the time discretization of (incompressible) Navier-Stokes equations by operator-splitting methods [2, 3]. Space discretization of the Stokes problem leads to large scale ill-conditioned systems. The Uzawa (preconditioned) conjugate gradient method is an efficient method for solving the Stokes p...
متن کاملDomain Decomposition Methods for a Complementarity Problem∗
We introduce a family of parallel Newton-Krylov-Schwarz methods for solving complementarity problems. The methods are based on a smoothed grid sequencing method, a semismooth inexact Newton method, and a twogrid restricted overlapping Schwarz preconditioner. We show numerically that such an approach is highly scalable in the sense that the number of Newton iterations and the number of linear it...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: PAMM
سال: 2003
ISSN: 1617-7061,1617-7061
DOI: 10.1002/pamm.200310106